On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
نویسندگان
چکیده
منابع مشابه
Ranking functions and rankings on languages
The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W—defined on a field of propositions A over W . This research note shows under which conditions ranking functions on a field...
متن کاملOn complete one-way functions
Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete one-way function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post correspon...
متن کاملOn Constructing 1-1 One-Way Functions
We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.
متن کاملAn NL-Complete Puzzle
We investigate the complexity of a puzzle that turns out to be NLcomplete.
متن کاملNew Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin’s result. We also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1993
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1993270201351